New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
نویسندگان
چکیده
منابع مشابه
An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
In this paper, we introduce an enhanced line search algorithm to accelerate the convergence of the alternating least squares (ALS) algorithm, which is often used to decompose a tensor in a sum of contributions. This scheme can be used for the computation in the complex case of the Parallel Factor model or the more general block component model. We then illustrate the performance of the algorith...
متن کاملLossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model states that a functional dependency preserving decomposition is lossless if and only if it contains a key. We will show that this result does not always hold when domains are allowed to be finite, but provide conditions u...
متن کاملNew Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کاملNew Methods to Find Optimal Non-Disjoint Bi-Decompositions
This paper presents new efficient methods to find “optimal bi-decomposition” forms of logic functions. An “optimal bi-decomposition” form of f(X) is f = α(g1(X ), g2(X )) where the total number of variables in X and X is the smallest among all bi-decomposition forms of f . We consider two methods; one’s decomposition form is (g1 · g2) and the other’s is (g1⊕g2). The proposed methods can find on...
متن کاملOptimal Block Size for Set-Valued Attributes
In a relational database management system, allowing tuples to be of variable length can complicate storage management considerably. As an example, consider an employee relation containing the employee’s name, social security number, and salary. We could store the names of the employee’s dependents in a separate relation, which would require an expensive join to access. As an alternative, we co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2011
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2011.2164911